Minimal polynomial descriptions of polyhedra and special semialgebraic sets
نویسندگان
چکیده
منابع مشابه
Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
Given a compact semialgebraic set S ⊆ R, a polynomial map f : S → R, we consider the problem of approximating the image set F = f(S). This includes in particular the projections of S on R, for n ≥ m. Assuming that F ⊆ B, with B ⊆ R being a “simple” set (box or ellipsoid), we provide two methods (called Method 1 and Method 2) to compute certified outer approximations of F : — The first approach ...
متن کاملPixelations of planar semialgebraic sets
We describe an algorithm that associates to each positive real number r and each finite collection Cr of planar pixels of size r a planar piecewise linear set Sr with the following additional property: if Cr is the collection of pixels of size r that touch a given compact semialgebraic set S, then the normal cycle of Sr converges to the normal cycle of S in the sense of currents. In particular,...
متن کاملConvexity in SemiAlgebraic Geometry and Polynomial Optimization
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for polynomial optimization simplifies and has finite convergence, a highly desirable feature as convex problems are in principle easier to solve. In addition, if a ba...
متن کاملTime-Dependent Generation of Minimal Sets of Spatial Descriptions
Talking about a location within a geometrically represented environment implies the translation of coordinates into suitable natural language expressions. Therefore, a reference semantics anchored in the given geometry has to be developed in order to be able to describe spatial relations between objects. Answering the question \Where is object X?" will lead to a large set of spatial proposition...
متن کاملMinimizing Polynomials Over Semialgebraic Sets
This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in R defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper [15], which considers minimizing polynomials on algebraic sets, i.e., sets in R defined by finitel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Geometry
سال: 2012
ISSN: 1615-7168,1615-715X
DOI: 10.1515/advgeom.2011.059